Finding the minimum energy conformation of protein-like heteropolymers by Greedy Neighborhood Search

نویسنده

  • Joon Suk Huh
چکیده

The prediction of a protein's tertiary structure, given its amino acid sequence, is one of the intriguing problems in biophysics and computational biology. Anfinsen's thermodynamic hypothesis indicates that the tertiary structure of a protein is the minimum free-energy conformation 1. Based on Anfinsen's hypothesis, the protein structure predict-tion problem can be treated as a global optimization problem of its given energy function. Unfortunately, there is no analytical solution for this problem because of the complexity of the energy function. Many global optimization methods such as Simulated Annealing (SA) 2 , Genetic Algorithm (GA) 3 , and Conformational Space Annealing (CSA) 4 have been proposed to deal with such hard optimization problems and successfully applied to various fields of science and engineering problems. A greedy algorithm is any algorithm that always takes the locally optimal solution while finding the global minimum of a function. Compared with above mentioned methods, it often fails to find the global minimum being trapped in a deep local minimum. A newly proposed global optimization method called Greedy Neighborhood Search (GNS) is belonged to the greedy algorithm class. GNS randomly generates the new solution adjacent to the current solution and then replaces the current one with the new one if the new one is better. Also GNS locates all the solutions on the minimum where the first derivative is zero and the second derivative is greater than zero by means of a local minimization algorithm. Because GNS randomly picks candidates on a minimum at each stage, it could escape from a deep local minimum unlike conventional greedy algorithms. In this paper, the GNS method with a novel conformational sampling method using a spherical distribution called von Mises-Fisher distribution 12 is applied to find the minimum energy conformation of a protein-like heteropolymer model called AB model 5. The AB model consists of only two types of monomers, Hydrophobic (A) and Hydrophilic (B) monomers analogous to the real proteins. Despite its simplicity, finding the minimum energy conform-ation of the AB model is very difficult and NP-complete problem. Unlike the traditional Hydropho-bic (H), Polar (P) lattice model 6 , only a few works were devoted to search the minimum energy con-formations of the AB model polymers 7-11. Because there is no rigorous proof to discriminate the true global minimum from many metastable local minima, the question is still open. The AB model The AB model polymers are modeled as an …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CGU: An Algorithm for Molecular Structure Prediction

A global optimization method is presented for predicting the minimum energy structure of small protein-like molecules. This method begins by collecting a large number of molecular conformations, each obtained by finding a local minimum of a potential energy function from a random starting point. The information from these conformers is then used to form a convex quadratic global underestimating...

متن کامل

Fitting the Three-parameter Weibull Distribution by using Greedy Randomized Adaptive Search Procedure

The Weibull distribution is widely employed in several areas of engineering because it is an extremely flexible distribution with different shapes. Moreover, it can include characteristics of several other distributions. However, successful usage of Weibull distribution depends on estimation accuracy for three parameters of scale, shape and location. This issue shifts the attentions to the requ...

متن کامل

Chain Length Scaling of Protein Folding Time.

Folding of protein-like heteropolymers into unique 3D structures is investigated using Monte Carlo simulations on a cubic lattice. We found that folding time of chains of length $N$ scales as $N^\lambda$ at temperature of fastest folding. For chains with random sequences of monomers $\lambda \approx 6$, and for chains with sequences designed to provide a pronounced minimum of energy to their gr...

متن کامل

A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure

A phylogeny is a tree that relates taxonomic units, based on their similarity over a set of characters. The phylogeny problem consists in finding a phylogeny with the minimum number of evolutionary steps. We propose a new neighborhood structure for the phylogeny problem. A greedy randomized adaptive search procedure heuristic based on this neighborhood structure and using variable neighborhood ...

متن کامل

Determination of an Empirical Energy Function for Protein Conformational Analysis by Energy Embedding

It is quite easy to propose an empirical potential for conformational analysis such that given crystal structures lie near local minima. What is much more difficult, is to devise a function such that the native structure lies near a relatively deep local minimum, at least in some neighborhood of the native in conformation space. An algorithm is presented for finding such a potential acting on p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016